Vertex Degree Sums for Perfect Matchings in 3-Uniform Hypergraphs
نویسندگان
چکیده
منابع مشابه
Vertex Degree Sums for Perfect Matchings in 3-uniform Hypergraphs
We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in a 3-graph without isolated vertex. More precisely, suppose that H is a 3-uniform hypergraph whose order n is sufficiently large and divisible by 3. If H contains no isolated vertex and deg(u)+deg(v) > 2 3 n2− 8 3 n+2 for any two vertices u and v that are contained in some edge of H, then H contains a...
متن کاملPerfect matching in 3 uniform hypergraphs with large vertex degree
A perfect matching in a 3-uniform hypergraph on n = 3k vertices is a subset of n3 disjoint edges. We prove that if H is a 3-uniform hypergraph on n = 3k vertices such that every vertex belongs to at least ( n−1 2 ) − ( 2n/3 2 ) + 1 edges then H contains a perfect matching. We give a construction to show that this result is best possible.
متن کاملExact minimum degree thresholds for perfect matchings in uniform hypergraphs
Article history: Received 19 August 2011 Available online xxxx Given positive integers k and where 4 divides k and k/2 k−1, we give a minimum -degree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is best possible and improves on work of Pikhurko who gave an asymptotically exact result. Our approach makes use of the absorbing method, as well as the hypergrap...
متن کاملTight Minimum Degree Conditions Forcing Perfect Matchings in Uniform Hypergraphs
Given positive integers k and ` where k/2 ≤ ` ≤ k− 1, we give a minimum `-degree condition that ensures a perfect matching in a kuniform hypergraph. This condition is best possible and improves on work of Pikhurko [12] who gave an asymptotically exact result, and extends work of Rödl, Ruciński and Szemerédi [15] who determined the threshold for ` = k−1. Our approach makes use of the absorbing m...
متن کاملPerfect matchings in uniform hypergraphs with large minimum degree
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a perfect matching in terms of a variant of the minimum degree. We prove that for every k ≥ 3 and sufficiently large n, a perfect matching exists in every n-vertex k-uniform hypergraph in which each set of k − 1 vertices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/7658